A Sound and Complete Proof Theory for Propositional Logical Contingencies
نویسندگان
چکیده
There are simple, purely syntactic axiomatic proof systems for both the logical truths and the logical falsehoods of propositional logic. However, to date no such system has been developed for the logical contingencies, that is, formulas that are both satisfiable and falsifiable. This paper formalizes and purely syntactic axiomatic proof systems for the logical contingencies and proves its soundness as well as completeness.
منابع مشابه
A Propositional Proof System with Permutation Quantifiers
Propositional proof complexity is a field of theoretical computer science which concerns itself with the lengths of formal proofs in various propositional proof systems. Frege systems are an important class of propositional proof systems. Extended Frege augments them by allowing the introduction of new variables to abbreviate formulas. Perhaps the largest open question in propositional proof co...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملProof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, following S. Negri’s general method for devising sequent calculi for normal modal logics. Although it arises as a natural formalization of the Krip...
متن کاملElementary-base cirquent calculus I: Parallel and choice connectives
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the game-semantically conceived logic of computational problems - see http://www.csc.villanova.edu/~japaridz/CL/ ) whose logical vocabulary consists of negation and paralle...
متن کاملAlgebraic Models and Complete Proof Calculi for Classical BI
We consider the classical (propositional) version, CBI, of O’Hearn and Pym’s logic of bunched implications (BI) from a modeland proof-theoretic perspective. We make two main contributions in this paper. Firstly, we present a class of algebraic models for CBI which permit the full range of classical multiplicative connectives to be modelled. Our models can be seen as generalisations of Abelian g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 48 شماره
صفحات -
تاریخ انتشار 2007